A Skorokhod Problem formulation and large deviation analysis of a processor sharing model

Generalized processor sharing has been proposed as a policy for distributing processing in a fair manner between diierent data classes in high-speed networks. In this paper we show how recent results on the Skorokhod Problem can be used to construct and analyze the mapping that takes the input processes into the buuer content. More precisely, we show how to represent the map in terms of a Skorokhod Problem, and from this infer that the mapping is well deened (existence and uniqueness) and well behaved (Lipschitz continuity). As an elementary application we present some large deviation estimates for a many data source model.